Scheduled service network design for integrated planning of rail freight transportation

Cette thèse étudie une approche intégrant la gestion de l’horaire et la conception de réseaux de services pour le transport ferroviaire de marchandises. Le transport par rail s’articule autour d’une structure à deux niveaux de consolidation où l’affectation des wagons aux blocs ainsi que des blocs aux services représentent des décisions qui complexifient grandement la gestion des opérations. Dans cette thèse, les deux processus de consolidation ainsi que l’horaire d’exploitation sont étudiés simultanément. La résolution de ce problème permet d’identifier un plan d’exploitation rentable comprenant les politiques de blocage, le routage et l’horaire des trains, de même que l’habillage ainsi que l’affectation du traffic. Afin de décrire les différentes activités ferroviaires au niveau tactique, nous étendons le réseau physique et construisons une structure de réseau espace-temps comprenant trois couches dans lequel la dimension liée au temps prend en considération les impacts temporels sur les opérations. De plus, les opérations relatives aux trains, blocs et wagons sont décrites par différentes couches. Sur la base de cette structure de réseau, nous modélisons ce problème de planification ferroviaire comme un problème de conception de réseaux de services. Le modèle proposé se formule comme un programme mathématique en variables mixtes. Ce dernie r s’avère très difficile à résoudre en raison de la grande taille des instances traitées et de sa complexité intrinsèque. Trois versions sont étudiées : le modèle simplifié (comprenant des services directs uniquement), le modèle complet (comprenant des services directs et multi-arrêts), ainsi qu’un modèle complet à très grande échelle. Plusieurs heuristiques sont développées afin d’obtenir de bonnes solutions en des temps de calcul raisonnables. Premièrement, un cas particulier avec services directs est analysé. En considérant une cara ctéristique spécifique du problème de conception de réseaux de services directs nous développons un nouvel algorithme de recherche avec tabous. Un voisinage par cycles est privilégié à cet effet. Celui-ci est basé sur la distribution du flot circulant sur les blocs selon les cycles issus du réseau résiduel. Un algorithme basé sur l’ajustement de pente est développé pour le modèle complet, et nous proposons une nouvelle méthode, appelée recherche ellipsoidale, permettant d’améliorer davantage la qualité de la solution. La recherche ellipsoidale combine les bonnes solutions admissibles générées par l’algorithme d’ajustement de pente, et regroupe les caractéristiques des bonnes solutions afin de créer un problème élite qui est résolu de facon exacte à l’aide d’un logiciel commercial. L’heuristique tire donc avantage de la vitesse de convergence de l’algorithme d’ajustement de pente et de la qualité de solution de la recherche ellipsoidale. Les tests numériques illustrent l’efficacité de l’heuristique proposée. En outre, l’algorithme représente une alternative intéressante afin de résoudre le problème simplifié. Enfin, nous étudions le modèle complet à très grande échelle. Une heuristique hybride est développée en intégrant les idées de l’algorithme précédemment décrit et la génération de colonnes. Nous proposons une nouvelle procédure d’ajustement de pente où, par rapport à l’ancienne, seule l’approximation des couts liés aux services est considérée. La nouvelle approche d’ajustement de pente sépare ainsi les décisions associées aux blocs et aux services afin de fournir une décomposition naturelle du problème. Les résultats numériques obtenus montrent que l’algorithme est en mesure d’identifier des solutions de qualité dans un contexte visant la résolution d’instances réelles.This thesis studies a scheduled service network design problem for rail freight transportation planning. Rails follow a special two level consolidation organization, and the car-to-block, block-to-service handling procedure complicates daily operations. In this research, the two consolidation processes as well as the operation schedule are considered simultaneously, and by solving this problem, we provide an overall cost-effective operating plan, including blocking policy, train routing, scheduling, make-up policy and traffic distribution. In order to describe various rail operations at the tactical level, we extend the physical network and construct a 3-layer time-space structure, in which the time dimension takes into consideration the temporal impacts on operations. Furthermore, operations on trains, blocks, and cars are described in different layers. Based on this network structure, we model the rail planning problem to a service network design formulation. The proposed model relies on a complex mixed-integer programming formulation. The problem is very hard to solve due to the computational difficulty as well as the tremendous size of the application instances. Three versions of the problem are studied, which are the simplified model (with only non-stop services), complete model (with both non-stop and multi-stop services) and very-large-scale complete model. Heuristic algorithms are developed to provide good feasible solutions in reasonable computing efforts. A special case with non-stop services is first studied. According to a specific characteristic of the direct service network design problem, we develop a tabu search algorithm. The tabu search moves in a cycle-based neighborhood, where flows on blocks are re-distributed according to the cycles in a conceptual residual network. A slope scaling based algorithm is developed for the complete model, and we propose a new method, called ellipsoidal search, to further improve the solution quality. Ellipsoidal search combines the good feasible solutions generated from the slope scaling, and collects the features of good solutions into an elite problem, and solves it with exact solvers. The algorithm thus takes advantage of the convergence speed of slope scaling and solution quality of ellipsoidal search, and is proven effective. The algorithm also presents an alternative for solving the simplified problem. Finally, we work on the very-large-size complete model. A hybrid heuristic is developed by integrating the ideas of previous research with column generation. We propose a new slope scaling scheme where, compared with the previous scheme, only approximate service costs instead of both service and block costs are considered. The new slope scaling scheme thus separates the block decisions and service decisions, and provide a natural decomposition of the problem. Experiments show the algorithm is good to solve real-life size instances

Data De-Duplication with Adaptive Chunking and Accelerated Modification Identifying

The data de-duplication system not only pursues the high de-duplication rate, which refers to the aggregate reduction in storage requirements gained from de-duplication, but also the de-duplication speed. To solve the problem of random parameter-setting brought by Content Defined Chunking (CDC), a self-adaptive data chunking algorithm is proposed. The algorithm improves the de-duplication rate by conducting pre-processing de-duplication to the samples of the classified files and then selecting the appropriate algorithm parameters. Meanwhile, FastCDC, a kind of content-based fast data chunking algorithm, is adopted to solve the problem of low de-duplication speed of CDC. By introducing de-duplication factor and acceleration factor, FastCDC can significantly boost de-duplication speed while not sacrificing the de-duplication rate through adjusting these two parameters. The experimental results demonstrate that our proposed method can improve the de-duplication rate by about 5 %, while FastCDC can obtain the increase of de-duplication speed by 50 % to 200 % only at the expense of less than 3 % de-duplication rate loss

Probing NaCl hydrate formation from aqueous solutions by Terahertz Time-Domain Spectroscopy

The cooling-induced formation of hydrate in aqueous NaCl solutions was probed using terahertz time-domain spectroscopy (THz-TDS). It was found that the NaCl hydrate formation is accompanied with emergence of four new absorption peaks at 1.60, 2.43, 3.34 and 3.78 THz. Combining the X-ray diffraction measurement with the solid-state based density functional theory (DFT) calculations, we assign the observed terahertz absorption peaks to the vibrational modes of the formed NaCl⋅2H2O hydrate during cooling. This work dedicates THz-TDS based analysis great potential in studying ionic hydrate and the newly revealed collective vibrational modes could be the sensitive indicators to achieve quantitative analysis in phase transitions and lattice dynamics

Scheduled Service Network Design for Freight Rail Transportation

This paper addresses the scheduled service network design problem for freight rail transportation. The proposed model integrates service selection and scheduling, car classification and blocking, train makeup, and routing of time-dependent customer shipments based on a cyclic three-layer space–time network representation of the associated operations and decisions and their relations and time dimensions. This paper also proposes a matheuristic solution methodology integrating slope scaling, a dynamic block-generation mechanism, long-term-memory-based perturbation strategies, and ellipsoidal search, a new intensification mechanism to thoroughly explore very large neighborhoods of elite solutions restricted using information from the history of the search. Experimental results show that the proposed solution method is efficient and robust, yielding high-quality solutions for realistically sized problem instances. </jats:p

L Antigen Family Member 3 Serves as a Prognostic Biomarker for the Clinical Outcome and Immune Infiltration in Skin Cutaneous Melanoma

L Antigen Family Member 3 (LAGE3) is an important RNA modification-related protein. Whereas few studies have interrogated the LAGE3 protein, there is limited data on its role in tumors. Here, we analyzed and profiled the LAGE3 protein in skin cutaneous melanoma (CM) using TCGA, GTEx, or GEO databases. Our data showed an upregulation of LAGE3 in melanoma cell lines compared to normal skin cell lines. Besides, the Kaplan–Meier curves and Cox proportional hazard model revealed that LAGE3 was an independent survival indicator for CM, especially in metastatic CM. Moreover, LAGE3 was negatively associated with multiple immune cell infiltration levels in CM, especially CD8+ T cells in metastatic CM. Taken together, our study suggests that LAGE3 could be a potential prognostic biomarker and might be a potential target for the development of novel CM treatment strategies

Molecular Epidemiological Survey of Canine Parvovirus Circulating in China from 2014 to 2019

The global distribution of canine parvovirus (CPV-2) derived from a closely related carnivore parvovirus poses a considerable threat to the dog population. The virus is continuously undergoing genetic evolution, giving rise to several variants. To investigate the prevalence of Chinese CPV-2 strains in recent years, a total of 30 CPV-2 strains were collected from 2018 to 2021 and the VP2 gene was sequenced and analyzed. Two variants, new CPV-2a (297Ala, 426Asn) and CPV-2c (426Glu), were identified. In contrast to previous reports, the CPV-2c variant has gained an epidemiological advantage over the new CPV-2a variant in China. To compensate for the relatively small sample size, 683 Chinese CPV-2 strains identified between 2014 and 2019 were retrieved from the GenBank database and previous publications, and analyses of these strains further supported our findings, which should be considered since the CPV-2c variant has been frequently associated with immune failure in adult dogs. VP2 protein sequence analysis revealed several amino acid substitutions, including Ala5Gly, Pro13Ser, Phe267Tyr, Tyr324Ile, Gln370Arg, Thr440Ala, and Lys570Arg. Phylogenetic analysis of full-length VP2 gene indicated a close relationship between Chinese strains and other Asian strains, suggesting mutual transmission between Asian countries. Furthermore, intercontinental transmission is a cause for concern. Surprisingly, two feline panleukopenia virus (FPV) strains with the Ile101Thr mutation in the VP2 protein were identified in canine fecal samples; FPV has been considered incapable of infecting dogs. This study clarified the epidemic characteristics of Chinese CPV-2 strains detected between 2014 and 2019, offering a reference for epidemic control. In addition, the detection of FPV in canine samples may provide information for future studies on the evolution of carnivore parvoviruses